Numbers for reducible cubic scrolls.
نویسندگان
چکیده
We show how to compute the number of reducible cubic scrolls of codimension 2 in Pn incident to the appropriate number of linear spaces.
منابع مشابه
The Universal K3 Surface of Genus 14 via Cubic Fourfolds
Using Hassett’s isomorphism between the Noether-Lefschetz moduli space C26 of special cubic fourfolds X ⊂ P of discriminant 26 and the moduli space F14 of polarized K3 surfaces of genus 14, we use the family of 3-nodal scrolls of degree seven in X to show that the universal K3 surface over F14 is rational.
متن کاملCountably Admissible Numbers and Linear Category Theory
Suppose Hadamard’s criterion applies. In [2], the authors address the existence of arrows under the additional assumption that every ultraconvex equation is independent. We show that B is geometric. It would be interesting to apply the techniques of [32] to reducible functionals. In contrast, the groundbreaking work of A. Wilson on functors was a major advance.
متن کاملDegenerations of Surface Scrolls and the Gromov-Witten Invariants of Grassmannians
We describe an algorithm for computing certain characteristic numbers of rational normal surface scrolls using degenerations. As a corollary we obtain an efficient method for computing the corresponding Gromov-Witten invariants of the Grassmannians of lines.
متن کاملIrregular Elliptic Surfaces of Degree 12 in the Projective Fourspace
The purpose of this paper is to give two different constructions of irregular surfaces of degree 12 in P4. These surfaces are new and of interest in the classification of smooth non-general type surfaces in P4. This classification problem is motivated by the theorem of Ellingsrud and Peskine [9] which says that the degree of smooth non-general type surfaces in P4 is bounded. Moreover the new fa...
متن کاملReducible cubic CNS polynomials
The concept of a canonical number system can be regarded as a natural generalization of decimal representations of rational integers to elements of residue class rings of polynomial rings. Generators of canonical number systems are CNS polynomials which are known in the linear and quadratic cases, but whose complete description is still open. In the present note reducible CNS polynomials are tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Anais da Academia Brasileira de Ciencias
دوره 76 4 شماره
صفحات -
تاریخ انتشار 2004